Reasons for Premature Convergence of Self-Adapting Mutation Rates
نویسندگان
چکیده
To self-adapt ([Schwefel, 1981], [Fogel et al., 1991]) a search parameter, rather than fixing the parameter globally before search begins the value is encoded in each individual along with the other genes. This is done in the hope that the value will then become adapted on a perindividual basis. While this mechanism is very powerful and in some cases essential to achieving good search performance, the dynamics of the adaptation of such traits are often complex and difficult to predict. This paper presents a case study in which self-adapting mutation rates were found to quickly drop below the threshold of effectiveness, bringing productive search to a premature halt. We identify three conditions that may in practice lead to such premature convergence of self-adapting mutation rates. The third condition is of particular interest, involving an interaction between self-adaptation and a process referred to here as “implicit self-adaptation”. Our investigation ultimately underlines a key aspect of population-based search: namely, how strongly search is directed toward finding solutions that are not just of high quality, but those which also produce other high quality solutions when subjected to the chosen variation process.
منابع مشابه
Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملInvestigation of Genetic Algorithms with Self-Adaptive Crossover, Mutation, and Selection
A method of self-adaptive mutation, crossover and selection was implemented and applied in four genetic algorithms. So developed self-adapting algorithms were then compared, with respect to convergence, with a traditional genetic one, which contained constant rates of mutation and crossover. The experiments were conducted on six benchmark functions including two unimodal functions, three multim...
متن کاملPremature Convergence in Constrained Continuous Search Spaces
The optimum of numerical problems quite often lies on the constraint boundary or even in a vertex of the feasible search space. In such cases the evolutionary algorithm (EA) frequently suffers from premature convergence because of a low success probability near the constraint boundaries. We analyze premature fitness stagnation and the success rates experimentally for an EA using self-adaptive s...
متن کاملSelf-adapting control parameters modified differential evolution for trajectory planning of manipulators
Control parameters of original differential evolution (DE) are kept fixed throughout the entire evolutionary process. However, it is not an easy task to properly set control parameters in DE for different optimization problems. According to the relative position of two different individual vectors selected to generate a difference vector in the searching place, a self-adapting strategy for the ...
متن کاملHYBRID COLLIDING BODIES OPTIMIZATION AND SINE COSINE ALGORITHM FOR OPTIMUM DESIGN OF STRUCTURES
Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Al...
متن کامل